Optimization algorithms exploiting unitary constraints
نویسندگان
چکیده
منابع مشابه
Optimization algorithms exploiting unitary constraints
This paper presents novel algorithms that iteratively converge to a local minimum of a real-valued function ( ) subject to the constraint that the columns of the complex-valued matrix are mutually orthogonal and have unit norm. The algorithms are derived by reformulating the constrained optimization problem as an unconstrained one on a suitable manifold. This significantly reduces the dimension...
متن کاملAlgorithms for stochastic optimization with expectation constraints
This paper considers the problem of minimizing an expectation function over a closed convex set, coupled with functional constraints given in the form of expectation. We present a new stochastic approximation (SA) type algorithm, namely the alternating mirror-descent SA (AMDSA) algorithm, to minimize these expectation constrained problems, and show that it exhibits the optimal rate of convergen...
متن کاملExploiting Constraints
Constraints can be exploited in paradigms outside of constraint programming. In particular, powerful global constraints can often be decomposed into small primitives and these decompositions can simulate complex propagation algorithms that perform sophisticated inference about a problem. We illustrate this approach with examples of exploiting constraints in propositional satisfiability (SAT), p...
متن کاملExploiting subproblem optimization in SAT-based MaxSAT algorithms
The Maximum Satisfiability (MaxSAT) problem is an optimization variant of the Satisfiability (SAT) problem. Several combinatorial optimization problems can be translated into a MaxSAT formula. Among exact MaxSAT algorithms, SAT-based MaxSAT algorithms are the best performing approaches for real-world problems. We have extended the WPM2 algorithm by adding several improvements. In particular, we...
متن کاملApproximation algorithms for homogeneous polynomial optimization with quadratic constraints
In this paper, we consider approximation algorithms for optimizing a generic multi-variate homogeneous polynomial function, subject to homogeneous quadratic constraints. Such optimization models have wide applications, e.g., in signal processing, magnetic resonance imaging (MRI), data training, approximation theory, and portfolio selection. Since polynomial functions are nonconvex in general, t...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: IEEE Transactions on Signal Processing
سال: 2002
ISSN: 1053-587X
DOI: 10.1109/78.984753